Countable periodic CC-groups as automorphism groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphism groups of countable structures

Suppose M is a countable first-order structure with a ‘rich’ automorphism group Aut(M). We will study Aut(M) both as a group and as a topological group, where the topology is that of pointwise convergence. This involves a mixture of model theory, group theory, combinatorics, descriptive set theory and topological dynamics. Here, ‘rich’ is undefined and depends on the context, but examples which...

متن کامل

Cycle-types in the automorphism groups of countable homogeneous graphs

We give a classification of all the cycle types occurring in the automorphism groups of countable homogeneous graphs.

متن کامل

Wreath products of cyclic p-groups as automorphism groups

We prove that if p is a prime and W is the standard wreath product of two nontrivial cyclic p-groups X and Y then W is isomorphic to the full automorphism group of some group if and only if |X| = 2 and |Y | is 2 or 4.

متن کامل

Chevalley Groups of Type G2 as Automorphism Groups of Loops

Let M∗(q) be the unique nonassociative finite simple Moufang loop constructed over GF (q). We prove that Aut(M∗(2)) is the Chevalley group G2(2), by extending multiplicative automorphism of M∗(2) into linear automorphisms of the unique split octonion algebra over GF (2). Many of our auxiliary results apply in the general case. In the course of the proof we show that every element of a split oct...

متن کامل

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1992

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500005551